Recursive functions of symbolic expressions and their computation by machine, Part I
نویسندگان
چکیده
منابع مشابه
The symbolic computation of vector field expressions
This is an expository paper explaining how trees can be used to compute effectively the vector field expressions which arise in nonlinear control theory. It also describe the mathematical structure that sets of trees carry.
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملStructures, Functions and Expressions of GnRH and GnRH Receptor in Peripheral Reproductive Organs and Their Regulation by Estradiol-17β
Studies have shown that estradiol-17β (E2) regulates gonadotropin-releasing hormone (GnRH) and GnRH receptor expression in hypothalamus and pituitary. Several studies have shown that GnRH and its receptor are also expressed in peripheral reproductive organs and little is known about their regulations. In this study, GnRH and GnRH receptor structures, functions, their peripheral expressions and ...
متن کاملSymbolic functions from neural computation.
Is thought computation over ideas? Turing, and many cognitive scientists since, have assumed so, and formulated computational systems in which meaningful concepts are encoded by symbols which are the objects of computation. Cognition has been carved into parts, each a function defined over such symbols. This paper reports on a research program aimed at computing these symbolic functions without...
متن کاملModels of Computation Primitive Recursive Functions
1 The primitive recursive functions 1.1 Intuitive syntax and semantics In informal mathematical notation we often define the addition function in the following way: 0 + n = n m + n = (m + n) We have used the notation m for the successor of the number m. In a functional language we can use a similar definition: add 0 n = n add (s m) n = s (add m n) We know that this is a meaningful definition si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 1960
ISSN: 0001-0782,1557-7317
DOI: 10.1145/367177.367199